Comparing Approaches To Resolution Based Higher-Order Theorem Proving

نویسنده

  • Christoph Benzmüller
چکیده

We investigate several approaches to resolution based automated theorem proving in classical higher-order logic (based on Church’s simply typed λ-calculus) and discuss their requirements with respect to Henkin completeness and full extensionality. In particular we focus on Andrews’ higher-order resolution (Andrews 1971), Huet’s constrained resolution (Huet 1972), higher-order E-resolution, and extensional higher-order resolution (Benzmüller and Kohlhase 1997). With the help of examples we illustrate the parallels and differences of the extensionality treatment of these approaches and demonstrate that extensional higher-order resolution is the sole approach that can completely avoid additional extensionality axioms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving

In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...

متن کامل

Automated Theorem Proving in First-Order Logic Modulo: On the Difference between Type Theory and Set Theory

Resolution modulo is a first-order theorem proving method that can be applied both to first-order presentations of simple type theory (also called higher-order logic) and to set theory. When it is applied to some first-order presentations of type theory, it simulates exactly higherorder resolution. In this note, we compare how it behaves on type theory and on set theory. Higher-order theorem pr...

متن کامل

Equality and extensionality in automated higher order theorem proving

This thesis focuses on equality and extensionality in automated higher-order theorem proving based on Church's simply typed -calculus (classical type theory). First, a landscape of various semantical notions is presented that is motivated by the di erent roles equality adopts in them. Each of the semantical notions in this landscape | including Henkin semantics | is then linked with an abstract...

متن کامل

Extensional Higher-Order Paramodulation and RUE-Resolution

This paper presents two approaches to primitive equality treatment in higher-order (HO) automated theorem proving: a calculus EP adapting traditional first-order (FO) paramodulation [RW69] , and a calculus ERUE adapting FO RUE-Resolution [Dig79] to classical type theory, i.e., HO logic based on Church’s simply typed λ-calculus. EP and ERUE extend the extensional HO resolution approach ER [BK98a...

متن کامل

Pseudo Zernike Moment-based Multi-frame Super Resolution

The goal of multi-frame Super Resolution (SR) is to fuse multiple Low Resolution (LR) images to produce one High Resolution (HR) image. The major challenge of classic SR approaches is accurate motion estimation between the frames. To handle this challenge, fuzzy motion estimation method has been proposed that replaces value of each pixel using the weighted averaging all its neighboring pixels i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Synthese

دوره 133  شماره 

صفحات  -

تاریخ انتشار 2002